Asymmetry in Ziv / Lempel ' 78
نویسنده
چکیده
We the compare the number of phrases created by Ziv/Lempel '78 parsing of a binary sequence and of its reversal. We show that the two parsings can vary by a factor that grows at least as fast as the logarithm of the sequence length. We then show that under a suitable condition, the factor can even become polynomial, and argue that the condition may not be necessary.
منابع مشابه
Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries
We present the first thorough practical study of the Lempel-Ziv-78 and the Lempel-Ziv-Welch computation based on trie data structures. With a careful selection of trie representations we can beat well-tuned popular trie data structures like Judy, m-Bonsai or Cedar.
متن کاملEnumeration of Binary Trees, Lempel-Ziv'78 Parsings, and Universal Types
Binary unlabeled ordered trees (further called binary trees) were studied at least since Euler, who enumerated them. The number of such trees with n nodes is now known as the Catalan number. Over the years various interesting questions about the statistics of such trees were investigated (e.g., height and path length distributions for a randomly selected tree). Binary trees find an abundance of...
متن کاملLempel Ziv Computation in Small Space (LZ-CISS)
For both the Lempel Ziv 77and 78-factorization we propose algorithms generating the respective factorization using (1 + ǫ)n lg n+O(n) bits (for any positive constant ǫ ≤ 1) working space (including the space for the output) for any text of size n over an integer alphabet in O ( n/ǫ )
متن کاملEnumeration of Binary Trees and Universal Types
Binary unlabeled ordered trees (further called binary trees) were studied at least since Euler, who enumerated them. The number of such trees with n nodes is now known as the Catalan number. Over the years various interesting questions about the statistics of such trees were investigated (e.g., height and path length distributions for a randomly selected tree). Binary trees find an abundance of...
متن کاملTitle Kolmogorov Complexity Estimation and Analysis
Methods for discerning and measuring Kolmogorov Complexity are discussed and their relationships explored. A computationally efficient method of using Lempel Ziv 78 Universal compression algorithm to estimate complexity is introduced. 1 Abstract—Methods for discerning and measuring Kolmogorov Complexity are discussed and their relationships explored. A computationally efficient method of using ...
متن کامل